Abbreviated Path Expressions With Iterated Wild Cards: WYSIWYG Semantics and Efficient Implementation

نویسندگان

  • Ahmed Abdelmeged
  • Karl Lieberherr
چکیده

Abbreviated Path expressions are used as an information hiding tool in Adaptive Programming (AP), eXtensible Markup Language (XML) document processing, and Aspect Oriented Programming (AOP). In the context of AP, the classical semantics of wild cards as place holders for any symbol leads to modularity and ambiguity problems when these wild cards are iterated. We show that a slightly restricted semantics for wild cards, called the WYSIWYG semantic can not only solve these problems but also lead to the construction of more efficient recognizers for abbreviated path expressions with iterated wild cards.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Abbreviated Path Expressions With Iterated Wild Cards: WYSIWYG Semantics and Efficient Recognition

Abbreviating paths with iterated wild cards is an abstraction mechanism common to Adaptive Programming (AP), eXtensible Markup Language (XML) document processing, and Aspect Oriented Programming (AOP). Recognition of abbreviated paths is used to for navigation in both AP and XML, and to decide upon advice execution in AOP. Finite state automata have been used for efficient recognition of abbrev...

متن کامل

ICM 2006 Mathematical Software

The increasing use of automatic computer processing of information re-quests a new approach in mathematical formula editors. We are used toWYSIWYG editors that produce beautiful presentation of formula. The newICT services, such as database searching or calculation web-services, requirestoring the semantic information behind a formula. This can only be donewith a new generat...

متن کامل

Reliability assessment of power distribution systems using disjoint path-set algorithm

Finding the reliability expression of different substation configurations can help design a distribution system with the best overall reliability. This paper presents a computerized a nd implemented algorithm, based on Disjoint Sum of Product (DSOP) algorithm. The algorithm was synthesized and applied for the first time to the determination of reliability expression of a substation to determine...

متن کامل

Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields

This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...

متن کامل

Compilation of Generic Regular Path Expressions Using C++ Class Templates

Various techniques for the navigation and matching of data structures using path expressions have been the subject of extensive investigations. No matter whether such techniques are based on type information, indexing, automata, it is desirable to synthesize implementations automatically, starting from a high-level description of the path expressions to be traversed. In this paper we present a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010